Asymptotically optimal induced decompositions
نویسندگان
چکیده
منابع مشابه
Asymptotically optimal induced universal graphs
We prove that the minimum number of vertices of a graph that contains every graph on k vertices as an induced subgraph is (1 + o(1))2(k−1)/2. This improves earlier estimates of Moon, of Bollobás and Thomason and of Alstrup, Kaplan, Thorup and Zwick. The method supplies similarly sharp estimates for the analogous problems for directed graphs, tournaments, bipartite graphs, oriented graphs and mo...
متن کاملAsymptotically optimal Kk-packings of dense graphs via fractional Kk-decompositions
Let H be a fixed graph. A fractional H-decomposition of a graph G is an assignment of nonnegative real weights to the copies of H in G such that for each e ∈ E(G), the sum of the weights of copies of H containing e is precisely one. An H-packing of a graph G is a set of edge disjoint copies of H in G. The following results are proved. For every fixed k > 2, every graph with n vertices and minim...
متن کاملAsymptotically Optimal Deterministic Rendezvous
In this paper, we address the deterministic rendezvous in graphs where k mobile agents, disseminated at different times and different nodes, have to meet in finite time at the same node. The mobile agents are autonomous, oblivious, labeled, and move asynchronously. Moreover, we consider an undirected anonymous connected graph. For this problem, we exhibit some asymptotical time and space lower ...
متن کاملAsymptotically optimal Boolean functions
The largest Hamming distance between a Boolean function in $n$ variables and the set of all affine Boolean functions in $n$ variables is known as the covering radius $\rho_n$ of the $[2^n,n+1]$ Reed-Muller code. This number determines how well Boolean functions can be approximated by linear Boolean functions. We prove that \[ \lim_{n\to\infty}2^{n/2}-\rho_n/2^{n/2-1}=1, \] which resolves a conj...
متن کاملAsymptotically optimal block quantization
for the mean-square quantizing error where N is the. number of level&p(x) is the probability density of the input, and E’(x) is the slope of the compressor curve. The formula, an approximation based on the assumption that the number of levels is large and overI& distortion is negligible, is a useful tool for analytical studies of quantfzation. This paper gives a bedstlc argument generallhg Beme...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applicable Analysis and Discrete Mathematics
سال: 2014
ISSN: 1452-8630,2406-100X
DOI: 10.2298/aadm140718009h